Symbolic template iterations of complex quadratic maps

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Template iterations and maximal cofinitary groups

In [2], Jörg Brendle used Hechler’s forcing notion for adding a maximal almost family along an appropriate template forcing construction to show that a (the minimal size of a maximal almost disjoint family) can be of countable cofinality. The main result of the present paper is that ag, the minimal size of maximal cofinitary group, can be of countable cofinality. To prove this we define a natur...

متن کامل

Dynamics of quadratic polynomials: complex bounds for real maps

© Annales de l’institut Fourier, 1997, tous droits réservés. L’accès aux archives de la revue « Annales de l’institut Fourier » (http://annalif.ujf-grenoble.fr/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier...

متن کامل

Iterations of Integer Polynomial Maps Modulo Primes

In this elementary note we discuss some questions related to the behavior of iterations of polynomial maps with integer coefficients modulo primes. In particular, we introduce three examples of such maps that have interesting dynamical properties. Several open questions are stated and discussed.

متن کامل

A Note on Quadratic Maps for Hilbert Space Operators

In this paper, we introduce the notion of sesquilinear map on Β(H) . Based on this notion, we define the quadratic map, which is the generalization of positive linear map. With the help of this concept, we prove several well-known equality and inequality...  

متن کامل

Practical policy iterations - A practical use of policy iterations for static analysis: the quadratic case

Policy iterations is a technique based on game theory that relies on a sequence of numerical optimization queries to compute the fixpoint of a set of equations. It has been proposed to support the static analysis of programs as an alternative to widening, when the latter is ineffective. This happens for instance with highly numerical codes, such as found at cores of control command applications...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nonlinear Dynamics

سال: 2016

ISSN: 0924-090X,1573-269X

DOI: 10.1007/s11071-016-2626-3